Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication

نویسندگان

  • Jure Leskovec
  • Deepayan Chakrabarti
  • Jon M. Kleinberg
  • Christos Faloutsos
چکیده

How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs obey a long list of surprising properties: Heavy tails for the inand out-degree distribution; heavy tails for the eigenvalues and eigenvectors; small diameters; and the recently discovered “Densification Power Law” (DPL). All published graph generators either fail to match several of the above properties, are very complicated to analyze mathematically, or both. Here we propose a graph generator that is mathematically tractable and matches this collection of properties. The main idea is to use a non-standard matrix operation, the Kronecker product, to generate graphs that we refer to as “Kronecker graphs”. We show that Kronecker graphs naturally obey all the above properties; in fact, we can rigorously prove that they do so. We also provide empirical evidence showing that they can mimic very well several real graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

KRONECKER GRAPHS: AN APPROACH TO MODELING NETWORKS Kronecker graphs: an approach to modeling networks

How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks exhibit a long list of surprising properties: Heavy tails for the inand out-degree distribution; heavy tails for the eigenvalues and eigenvectors; small diameters; and densification and shrinking diameters over time. T...

متن کامل

Kronecker Graphs: An Approach to Modeling Networks

How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks exhibit a long list of surprising properties: Heavy tails for the inand out-degree distribution, heavy tails for the eigenvalues and eigenvectors, small diameters, and densification and shrinking diameters over time. C...

متن کامل

Modeling Network Structure using Kronecker Multiplication∗

Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to use “Kronecker graphs”, which naturally obey all of the above properties. We present a fast linear time algorithm for fitting the Kronecker graph generation model to real networks. Experiments on la...

متن کامل

Modeling and Analysis of Real World Networks using Kronecker Graphs

It has been observed that self-similarity is an emergent property of many real world networks such as WWW, e-mail and biological networks. These networks show properties such as heavy tails for the inand out-degree distribution, heavy tails for the eigenvalues and eigenvectors, small diameters, and densification and shrinking diameters over time. Recently, Kronecker Graphs have been shown to el...

متن کامل

CS224W: Social and Information Network Analysis

In this project, we plan to explore the property of self-similarity exhibited by real world networks, and the use of Kronecker graphs to model and analyze such networks. It has been observed that self-similarity is an emergent property of many real world networks such as WWW, e-mail and biological networks. These networks show properties such as heavy tails for the inand out-degree distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005